Analysis of travelling salesman problem

An Analysis of the Fitness Landscape of Travelling Salesman Problem

The fitness landscape of the travelling salesman problem is investigated for 11 different types of the problem. The types differ in how the distances between cities are generated. Many different properties of the landscape are studied. The properties chosen are all potentially relevant to choosing an appropriate search algorithm. The analysis includes a scaling study of the time to reach a loca...

A replica analysis of the travelling salesman problem

Comparative Analysis of Various Algorithms Used in Travelling Salesman Problem

The Travelling Salesman Problem is a well known problem which has becomea comparison benchmark test for different computational methods. Its solution is computationally difficult, although the problem is easily expressed. TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background. The aim of our work is to compare existing algorithms that ar...

The multi-stripe travelling salesman problem

In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...

A Survey on Travelling Salesman Problem

The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...